Lambek Calculus and Preposing of Embedded Subjects*

نویسندگان

  • Richard T. Oehrle
  • Shi Zhang
  • Sunseek Oh
چکیده

A variety of accounts of this paradigm have been offered in the literature. We mention Bresnan's (1972) Fixed Subject Constraint and the *that -trace filter of Chomsky & Lasnik (1977) and subsequent work in the GB tradition. These two accounts share the view that the explanation of the oddity of (3) lies in prohibiting an element of a certain sort -namely, the complementizer that -from preceding a gap of a certain kind. In this paper, we investigate the problem from a somewhat different angle. We assume an analytic framework in which there are no gaps, and hence, no gaps of the sort required by the accounts of either Bresnan or Chomsky & Lasnik. We first review the properties of two categorial systems, the Associative Syntactic Calculus AL (Lambek, 1958) and the NonAssociative Syntactic Calculus nAL (Lambek, 1961), and show how they are adapatable to the analysis of simple sentences. We then show, following Steedman (1985), how categorial systems of this kind can treat discontinuous dependencies of the sort found in English topicalization and whmovement in simple clauses. It is not altogether obvious how to treat the paradigm above within this framework of assumptions. The remainder of the paper is devoted to showing how this can be done.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjunctive Categorial Grammars

Basic categorial grammars are enriched with a conjunction operation, and it is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context-free grammars enhanced with conjunction. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations. Thi...

متن کامل

Efficient Parsing with the Product-Free Lambek Calculus

This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...

متن کامل

Efficiently Parsing with the Product-Free Lambek Calculus

This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...

متن کامل

Parsing CCGbank with the Lambek Calculus

This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight...

متن کامل

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the unit constant, Lb∗1, into the Lambek calculus with brackets allowing empty antecedents, but without the unit constant, Lb∗. Using this translation, we extend previously known results for Lb∗ to Lb∗1: (1) languages generated by categorial grammars based on the Lambek calculus with brackets are context-free (Kanazawa 2017); (2)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012